Uniqueness in Logic Puzzles

نویسنده

  • Cameron Browne
چکیده

Cameron Browne, Queensland University of Technology (QUT) Pure deduction puzzles typically have a single unique solution. However, some puzzle setters argue that challenges with multiple solutions are also valid, if they can be solved by eliminating choices that lead to ambiguous states. This paper considers the arguments for and against this position, and presents a counterexample that demonstrates the danger of using uniqueness to decide between multiple solutions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Cellular Puzzles with Logic Programs

We show how to characterize puzzles by logic programs and how to use those characterizations to build puzzles automatically. We can control the difficulty level of the puzzles by choosing how and when to invoke the logic program.

متن کامل

Automated generation and visualization of picture-logic puzzles

A picture-logic puzzle is a game that takes the form of an N M grid, with numbers situated on the left of its rows and on the top of its columns, which give the clues for solving the puzzle. These puzzles have gained popularity in the last years all over the world, and there are companies involved in the commercialization of products related to them, mainly magazines, on-line puzzles via the we...

متن کامل

Pattern-Based Constraint Satisfaction and Logic Puzzles

Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the"simplest"solution. Different ways of reasoning with the constraints are formalised by various families of"resolution rules", each of them carrying its own notion of simplicity. A large part of the book ...

متن کامل

From Logic Puzzles to Logic Gates – Combining Fun and Practice in Teaching Introduction to Computer Science

Introduction to Computer Science is a foundation course in undergraduate programs in computer and computational sciences. It covers wide spectrum of topics in hardware and software systems, including evolution of computer architecture and its basic components, numbers and operations, binary and hexadecimal numeral systems, data representation as bit patterns, logic gates, etc. The course provid...

متن کامل

Teaching Constraints through Logic Puzzles

The paper describes the experiences of seven years of teaching a constraint logic programming course at the Budapest University of Technology and Economics. We describe the structure of the course, the material covered, some examples, assignments, and examination tasks. Throughout the paper we show how logic puzzles can be used to illustrate constraint programming techniques.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015